Numerical Algorithms for Symbolic Analysis of Large Circuits

نویسندگان

  • ZDENĚK KOLKA
  • MARTIN HORÁK
  • VIERA BIOLKOVÁ
چکیده

This paper presents an algorithm for fast large-change sensitivity computation for approximate symbolic analysis. The sensitivity is used for identifying negligible elements of circuit model that can be removed in order to simplify symbolic solution. The method is based on combination of the Sherman-Morison formula and sparse matrix techniques. Effectiveness of the method was tested on several benchmark circuits. Key-Words: Approximate Symbolic Analysis, Numerical Algorithms, CAD

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Algorithms for Reference Generation in Symbolic Analysis or Large Analog Circuits

This paper addresses the problems arising in the calculation of numerical references (network function coefficients), essential for an appropriate error control in simplification before and during generation algorithms for symbolic analysis of large analog circuits. The conventional polynomial interpolation method reveals to be unable to handle the large circuit sizes needed, mainly due to the ...

متن کامل

An evolutionary-based methodology for symbolic simplification of analog circuits using genetic algorithm and simulated annealing

In this paper, an evolutionary-based multi-objective criterion is introduced for simplified symbolic smallsignal analysis of analog circuits containing MOSFETs. After circuit analysis via modified nodal analysis technique, the derived exact symbolic transfer function of the circuit behavior is automatically simplified. In contrast to traditional simplification criteria, the main objective of ou...

متن کامل

Canonical symbolic analysis of large analog circuits withdeterminant decision diagrams

Symbolic analysis has many applications in the design of analog circuits. Existing approaches rely on two forms of symbolic-expression representation: expanded sum-of-product form and arbitrarily nested form. Expanded form suffers the problem that the number of product terms grows exponentially with the size of a circuit. Nested form is neither canonical nor amenable to symbolic manipulation. I...

متن کامل

Graph-based Parallel Analysis of Large Analog Circuits Based on GPU Platforms

In this paper, we propose a new parallel analysis method for large analog circuits using determinant decision diagram (DDD) based graph technique. DDD-based symbolic analysis technique enables exact symbolic analysis of vary large analog circuits. Once the circuit small-signal characteristics are presented by DDDs, evaluation of DDDs will give exact numerical values. In this paper, we develop e...

متن کامل

Hierarchical Symbolic Analysis of Large Analog Circuits with Determinant Decision Diagrams

A novel hierarchical approach is proposed to symbolic analysis of large analog circuits. The key idea is to use a graph-based representation—called Determinant Decision Diagram (DDD)— to represent the symbolic determinant and cofactors associated with the MNA matrix for each subcircuit block. By exploiting the inherent sharing and sparsity of symbolic expressions, DDD is capable of representing...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006